Solving Ptychography with a Convex Relaxation: Supplementary Material
نویسندگان
چکیده
Require: Algorithm parameters γ > 1 and η < 1, an auxiliary scalar vk, iteration counter iter = 0, and the maximum number of iterations maxiter. Ensure: A critical point 1: Initiate y0 and σ0. 2: repeat 3: Given yk and σk, solve (1.1) to find the minimizer Rk via the LBFGS algorithm. 4: Compute v = ∑ i ( tr(DiRkR T k )− bi )2 . 5: if v < ηvk then 6: y i = y k i − σk · ( tr(DiRkR T k )− bi ) for all i,
منابع مشابه
Solving ptychography with a convex relaxation.
Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currently solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reco...
متن کاملDiffraction tomography with Fourier ptychography: supplementary material
This document provides supplementary information for “Diffraction tomography with Fourier ptychography," http://dx.doi.org/10.1364/optica.3.000827. It analyzes the convergence of the Fourier ptychographic tomography (FPT) algorithm in the presence of noise, then examines the connection between the first Born approximation and the multi-slice model, and finally includes additional experimental r...
متن کاملSublabel - Accurate Convex Relaxation of Vectorial Multilabel Energies – Supplementary Material –
متن کامل
Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints
This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we combine the proposed algorithm with a relaxation technique to handle inconsistent linearizations. Nu...
متن کاملLaGO - An Object Oriented Library for Solving MINLPs
The paper describes a software package called LaGO for solving nonconvex mixed integer nonlinear programs (MINLPs). The main component of LaGO is a convex relaxation which is used for generating solution candidates and computing lower bounds of the optimal value. The relaxation is generated by reformulating the given MINLP as a block-separable problem, and replacing nonconvex functions by conve...
متن کامل